A Model of Intuitionistic Affine Logic From Stable Domain Theory
نویسنده
چکیده
Girard worked with the category of coherence spaces and continuous stable maps and observed that the functor that forgets the linearity of linear stable maps has a left adjoint. This fundamental observation gave rise to the discovery of Linear Logic. Since then, the category of coherence spaces and linear stable maps, with the comonad induced by the adjunction, has been considered a canonical model of Linear Logic. Now, the same phenomenon is present if we consider the category of pre dI domains and continuous stable maps, and the category of dI domains and linear stable maps; the functor that forgets the linearity has a left adjoint. This gives an alternative model of Intuitionistic Linear Logic. It turns out that this adjunction can be factored in two adjunctions yielding a model of Intuitionistic Affine Logic; the category of pre dI domains and affine stable functions. It is the goal of this paper to show that this category is actually a model of Intuitionistic Affine Logic, and to show that this category moreover has properties which make it possible to use it to model convergence/divergence behaviour and recursion. ∗Internet: [email protected] †Basic Research in Computer Science, Centre of the Danish National Research Foundation.
منابع مشابه
Evaluating Construction Projects by a New Group Decision-Making Model Based on Intuitionistic Fuzzy Logic Concepts
Select an appropriate project is a main key for contractors to increase their profits. In practice, in this area the uncertainty and imprecise of the involved parameters is so high. Therefore, considering fuzzy sets theory to deal with uncertainly is more appreciate. The aim of this paper is present a multi-criteria group decision-making model under an intuitionistic fuzzy set environment. Henc...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملFrom parametric polymorphism to models of polymorphic FPC
This paper shows how PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin’s encodings of recursive types in PILLY we show how parametric models of PILLY give rise to models of FPC, a simply typed lambda cal...
متن کاملPattern Unification for the Lambda Calculus with Linear and Affine Types
Logic programming languages, type inference algorithms, and automated theorem provers are all examples of systems that rely on unification. If the unification problem has to deal with logic variables at higher type (functional type), we speak of higher-order unification [4]. Higher-order unification is in general undecidable, but it can be turned decidable, if appropriately restricted to a frag...
متن کاملComments on the Logic of Constructible
Nelson has presented a constructive arithmetic with a negation operation (−) different from the ordinary intuitionistic one (¬). In [5] he presents a variant of Kleene's realization semantics for intuitionistic arithmetic, and proves that relative to this interpretation the arithmetic language with – has the same expressive power as the usual intuitionistic one, and fact certain theories of ari...
متن کامل